Computational Improvements to Matrix Operations

نویسنده

  • Gordon Chalmers
چکیده

An alternative to the matrix inverse procedure is presented. Given a bit register which is arbitrarily large, the matrix inverse to an arbitrarily large matrix can be peformed in O(N 2) operations, and to matrix multiplication on a vector in O(N).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Vibration Analysis of Global Near-regular Mechanical Systems

Some near-regular mechanical systems involve global deviations from their corresponding regular system. Despite extensive research on vibration analysis (eigensolution) of regular and local near-regular mechanical systems, the literature on vibration analysis of global near-regular mechanical systems is scant. In this paper, a method for vibration analysis of such systems was developed using Kr...

متن کامل

Computing the Combinatorial Canonical Form of a Layered Mixed Matrix

This paper presents an improved algorithm for computing the Combinatorial Canonical Form (CCF) of a layered mixed matrix A = Q T , which consists of a numerical matrix Q and a generic matrix T . The CCF is the (combinatorially unique) nest block-triangular form obtained by the row operations on the Q-part, followed by permutations of rows and columns of the whole matrix. The main ingredient of ...

متن کامل

Performance Improvement of Sparse Matrix Vector Product on Vector Machines

Many applications based on finite element and finite difference methods include the solution of large sparse linear systems using preconditioned iterative methods. Matrix vector multiplication is one of the key operations that has a significant impact on the performance of any iterative solver. In this paper, recent developments in sparse storage formats on vector machines are reviewed. Then, s...

متن کامل

A Block Algorithm for Matrix 1-Norm Estimation, with an Application to 1-Norm Pseudospectra

The matrix 1-norm estimation algorithm used in LAPACK and various other software libraries and packages has proved to be a valuable tool. However, it has the limitations that it offers the user no control over the accuracy and reliability of the estimate and that it is based on level 2 BLAS operations. A block generalization of the 1-norm power method underlying the estimator is derived here an...

متن کامل

Flow Shop Scheduling Problem with Missing Operations: Genetic Algorithm and Tabu Search

Flow shop scheduling problem with missing operations is studied in this paper. Missing operations assumption refers to the fact that at least one job does not visit one machine in the production process. A mixed-binary integer programming model has been presented for this problem to minimize the makespan. The genetic algorithm (GA) and tabu search (TS) are used to deal with the optimization...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006